Matching delaunay graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Witness (Delaunay) graphs

Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable ...

متن کامل

Stable Delaunay Graphs

Let P be a set of n points in R2, and let DT(P) denote its Euclidean Delaunay triangulation. We introduce the notion of an edge of DT(P) being stable. Defined in terms of a parameter α > 0, a Delaunay edge pq is called α-stable, if the (equal) angles at which p and q see the corresponding Voronoi edge epq are at least α. A subgraph G of DT(P) is called (cα, α)-stable Delaunay graph (SDG in shor...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

Outerplanar graphs and Delaunay triangulations

Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new, alternate, also quite elementary proofs.

متن کامل

Constrained Empty-Rectangle Delaunay Graphs

Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose endpoints are in P , a constrained generalized Delaunay graph of P with respect to C denoted CDGC(P ) is constructed by adding an edge between two points p and q if and only if there exists a homothet of C with p and q on its boundary and no point of P in the interior visible to both p and q. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 1997

ISSN: 0031-3203

DOI: 10.1016/s0031-3203(96)00060-x